3 research outputs found
HIERARCHICAL CLUSTERING USING LEVEL SETS
Over the past several decades, clustering algorithms have earned their place as a go-to solution for database mining. This paper introduces a new concept which is used to develop a new recursive version of DBSCAN that can successfully perform hierarchical clustering, called Level- Set Clustering (LSC). A level-set is a subset of points of a data-set whose densities are greater than some threshold, ‘t’. By graphing the size of each level-set against its respective ‘t,’ indents are produced in the line graph which correspond to clusters in the data-set, as the points in a cluster have very similar densities. This new algorithm is able to produce the clustering result with the same O(n log n) time complexity as DBSCAN and OPTICS, while catching clusters the others missed
Theory of Amorphous Packings of Binary Mixtures of Hard Spheres
We extend our theory of amorphous packings of hard spheres to binary mixtures
and more generally to multicomponent systems. The theory is based on the
assumption that amorphous packings produced by typical experimental or
numerical protocols can be identified with the infinite pressure limit of long
lived metastable glassy states. We test this assumption against numerical and
experimental data and show that the theory correctly reproduces the variation
with mixture composition of structural observables, such as the total packing
fraction and the partial coordination numbers.Comment: 10 pages, 3 figure